Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
نویسندگان
چکیده
منابع مشابه
Optimal MDS codes for cooperative repair
Two widely studied models of multiple-node repair in distributed storage systems are centralized repair and cooperative repair. The centralized model assumes that all the failed nodes are recreated in one location, while the cooperative one stipulates that the failed nodes may communicate but are distinct, and the amount of data exchanged between them is included in the repair bandwidth. We sho...
متن کاملExplicit MDS Codes for Optimal Repair Bandwidth
MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has r parities and no more than r erasures occur, then by transmitting all the remaining data in the code, the original information can be recovered. However, it was shown that in order to recover a single symbol erasure, only a fraction of 1/...
متن کاملConstructions of MDS-convolutional codes
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...
متن کاملNew constructions of MDS symbol-pair codes
Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with large minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining maximal mi...
متن کاملUltimate Codes: Near-Optimal MDS Array Codes for RAID-6
As modern storage systems have grown in size and complexity, RAID-6 is poised to replace RAID-5 as the dominant form of RAID architectures due to its ability to protect against double disk failures. Many excellent erasure codes specially designed for RAID-6 have emerged in recent years. However, all of them have limitations. In this paper, we present a class of near perfect erasure codes for RA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2856206